On the ω-language Expressive Power of Extended Petri Nets
نویسندگان
چکیده
In this paper, we study the expressive power of several monotonic extensions of Petri nets. We compare the expressive power of Petri nets, Petri nets extended with nonblocking arcs and Petri nets extended with transfer arcs, in terms of ω-languages. We show that the hierarchy of expressive powers of those models is strict. To prove these results, we propose original techniques that rely on well-quasi orderings and monotonicity properties.
منابع مشابه
On the expressive power of Petri nets with transfer arcs vs. Petri nets with reset arcs
In this paper, we revisit the conjecture of [1], stating that ε-free Petri nets with transfer arcs are strictly more expressive than ε-free Petri nets with reset arcs. In [1], an ε-free Petri net with transfer arcs is provided, whose language is conjectured not to be recognizable by any ε-free Petri net with reset arcs. We show that this latter conjecture is flawed, by exhibiting an ε-free Petr...
متن کاملReduction rules for reset/inhibitor nets
Reset/inhibitor nets are Petri nets extended with reset arcs and inhibitor arcs. These extensions can be used to model cancelation and blocking. A reset arc allows a transition to remove all tokens from a certain place when the transition fires. An inhibitor arc can stop a transition from being enabled if the place contains one or more tokens. While reset/inhibitor nets increase the expressive ...
متن کاملColoured Petri Nets with Parallel Composition to Separate Concerns
We define a modeling language based on combining Coloured Petri Nets with Protocol Modeling semantics. This language combines the expressive power of Coloured Petri Nets in describing behavior with the ability provided by Protocol Modeling to compose partial behavioral descriptions. The resultant language can be considered as a domain specific Coloured Petri Net based language for deterministic...
متن کاملLanguage-Based Comparison of Petri Nets with Black Tokens, Pure Names and Ordered Data
We apply language theory to compare the expressive power of models that extend Petri nets with features like colored tokens and/or whole place operations. Specifically, we consider extensions of Petri nets with transfer and reset operations defined for black indistinguishable tokens (Affine Well-Structured Nets), extensions in which tokens carry pure names dynamically generated with special ν-t...
متن کاملModelling, Reduction and Analysis of Markov Automata (extended version)
Markov automata (MA) constitute an expressive continuoustime compositional modelling formalism. They appear as semantic backbones for engineering frameworks including dynamic fault trees, Generalised Stochastic Petri Nets, and AADL. Their expressive power has thus far precluded them from effective analysis by probabilistic (and statistical) model checkers, stochastic game solvers, or analysis t...
متن کامل